0.07/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.07/0.13	% Command    : run_E %s %d THM
0.13/0.34	% Computer : n004.cluster.edu
0.13/0.34	% Model    : x86_64 x86_64
0.13/0.34	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.34	% Memory   : 8042.1875MB
0.13/0.34	% OS       : Linux 3.10.0-693.el7.x86_64
0.13/0.34	% CPULimit   : 960
0.13/0.34	% WCLimit    : 120
0.13/0.34	% DateTime   : Tue Aug  9 03:54:50 EDT 2022
0.13/0.34	% CPUTime    : 
0.20/0.47	Running higher-order on 8 cores theorem proving
0.20/0.47	Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=120 /export/starexec/sandbox/benchmark/theBenchmark.p
0.20/0.47	# Version: 3.0pre003-ho
24.60/3.60	# Preprocessing class: HSMSSMSSSSSNHHA.
24.60/3.60	# Scheduled 6 strats onto 8 cores with 120 seconds (960 total)
24.60/3.60	# Starting full_lambda_6 with 360s (3) cores
24.60/3.60	# Starting post_as_ho1 with 120s (1) cores
24.60/3.60	# Starting lpo6_lambda_fix with 120s (1) cores
24.60/3.60	# Starting ho_unfolding_1 with 120s (1) cores
24.60/3.60	# Starting new_ho_10_unif with 120s (1) cores
24.60/3.60	# Starting ho_unfolding_2 with 120s (1) cores
24.60/3.60	# full_lambda_6 with pid 26021 completed with status 0
24.60/3.60	# Result found by full_lambda_6
24.60/3.60	# Preprocessing class: HSMSSMSSSSSNHHA.
24.60/3.60	# Scheduled 6 strats onto 8 cores with 120 seconds (960 total)
24.60/3.60	# Starting full_lambda_6 with 360s (3) cores
24.60/3.60	# SinE strategy is GSinE(CountTerms,hypos,4,,4,20000,1.0,true)
24.60/3.60	# ...ProofStateSinE()=1/2
24.60/3.60	# Search class: HGHNF-FFSF22-SHHFFSBN
24.60/3.60	# Scheduled 6 strats onto 3 cores with 360 seconds (360 total)
24.60/3.60	# Starting new_ho_10_unif with 108s (1) cores
24.60/3.60	# Starting full_lambda_6 with 37s (1) cores
24.60/3.60	# Starting sh5l with 55s (1) cores
24.60/3.60	# new_ho_10_unif with pid 26028 completed with status 0
24.60/3.60	# Result found by new_ho_10_unif
24.60/3.60	# Preprocessing class: HSMSSMSSSSSNHHA.
24.60/3.60	# Scheduled 6 strats onto 8 cores with 120 seconds (960 total)
24.60/3.60	# Starting full_lambda_6 with 360s (3) cores
24.60/3.60	# SinE strategy is GSinE(CountTerms,hypos,4,,4,20000,1.0,true)
24.60/3.60	# ...ProofStateSinE()=1/2
24.60/3.60	# Search class: HGHNF-FFSF22-SHHFFSBN
24.60/3.60	# Scheduled 6 strats onto 3 cores with 360 seconds (360 total)
24.60/3.60	# Starting new_ho_10_unif with 108s (1) cores
24.60/3.60	# Preprocessing time       : 0.001 s
24.60/3.60	# Presaturation interreduction done
24.60/3.60	
24.60/3.60	# Proof found!
24.60/3.60	# SZS status Theorem
24.60/3.60	# SZS output start CNFRefutation
24.60/3.60	thf(decl_22, type, epred1_0: a > a > $o).
24.60/3.60	thf(decl_23, type, esk1_0: (a > $o) > a).
24.60/3.60	thf(decl_24, type, esk2_0: a > a).
24.60/3.60	thf(decl_25, type, esk3_2: (a > $o) > a > a).
24.60/3.60	thf(cT145_DOUBLE, conjecture, ![X1:a > a > $o, X2:(a > $o) > a]:((![X3:a > a]:((?[X4:a]:((((X1 @ (X3 @ X4) @ X4)|(X1 @ (X3 @ X4) @ X4))&((X1 @ X4 @ (X3 @ X4))|(X1 @ X4 @ (X3 @ X4)))))|?[X5:a, X6:a]:((((X1 @ X5 @ X6)|(X1 @ X5 @ X6))&(~((X1 @ (X3 @ X5) @ (X3 @ X6)))|~((X1 @ (X3 @ X5) @ (X3 @ X6))))))))|?[X7:a > $o]:((?[X8:a]:(((~((X1 @ (X2 @ X7) @ X8))|~((X1 @ (X2 @ X7) @ X8)))&![X9:a]:(((X1 @ X9 @ X8)|(X1 @ X9 @ X8)|~((X7 @ X9))|~((X7 @ X9))))))|?[X10:a]:((((X7 @ X10)|(X7 @ X10))&(~((X1 @ X10 @ (X2 @ X7)))|~((X1 @ X10 @ (X2 @ X7))))))))|?[X11:a, X12:a, X13:a]:(((((X1 @ X12 @ X13)|(X1 @ X12 @ X13))&(~((X1 @ X11 @ X13))|~((X1 @ X11 @ X13))))&((X1 @ X11 @ X12)|(X1 @ X11 @ X12)))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', cT145_DOUBLE)).
24.60/3.60	thf(c_0_1, negated_conjecture, ~(![X1:a > a > $o, X2:(a > $o) > a]:((![X3:a > a]:((?[X4:a]:(((X1 @ (X3 @ X4) @ X4)&(X1 @ X4 @ (X3 @ X4))))|?[X5:a, X6:a]:(((X1 @ X5 @ X6)&~(X1 @ (X3 @ X5) @ (X3 @ X6))))))|?[X7:a > $o]:((?[X8:a]:((~(X1 @ (X2 @ X7) @ X8)&![X9:a]:(((X1 @ X9 @ X8)|~(X7 @ X9)|~(X7 @ X9)))))|?[X10:a]:(((X7 @ X10)&~(X1 @ X10 @ (X2 @ X7))))))|?[X11:a, X12:a, X13:a]:((((X1 @ X12 @ X13)&~(X1 @ X11 @ X13))&(X1 @ X11 @ X12)))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[cT145_DOUBLE])])).
24.60/3.60	thf(c_0_2, negated_conjecture, ![X30:a, X31:a, X32:a, X33:a > $o, X34:a, X36:a, X37:a, X38:a, X39:a]:(((((~(epred1_0 @ (esk2_0 @ X30) @ X30)|~(epred1_0 @ X30 @ (esk2_0 @ X30)))&(~(epred1_0 @ X31 @ X32)|(epred1_0 @ (esk2_0 @ X31) @ (esk2_0 @ X32))))&((((~(epred1_0 @ (esk3_2 @ X33 @ X34) @ X34)|(epred1_0 @ (esk1_0 @ X33) @ X34))&((X33 @ (esk3_2 @ X33 @ X34))|(epred1_0 @ (esk1_0 @ X33) @ X34)))&((X33 @ (esk3_2 @ X33 @ X34))|(epred1_0 @ (esk1_0 @ X33) @ X34)))&(~(X33 @ X36)|(epred1_0 @ X36 @ (esk1_0 @ X33)))))&(~(epred1_0 @ X38 @ X39)|(epred1_0 @ X37 @ X39)|~(epred1_0 @ X37 @ X38)))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_1])])])])])).
24.60/3.60	thf(c_0_3, negated_conjecture, ![X6:a, X5:a, X4:a]:(((epred1_0 @ X6 @ X5)|~((epred1_0 @ X4 @ X5))|~((epred1_0 @ X6 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_2])).
24.60/3.60	thf(c_0_4, negated_conjecture, ![X7:a > $o, X4:a]:(((X7 @ (esk3_2 @ X7 @ X4))|(epred1_0 @ (esk1_0 @ X7) @ X4))), inference(split_conjunct,[status(thm)],[c_0_2])).
24.60/3.60	thf(c_0_5, negated_conjecture, ![X3:a > a, X4:a, X16:a > a, X5:a]:(((epred1_0 @ (X3 @ (esk3_2 @ (^[Z0:a]:((epred1_0 @ (X3 @ Z0) @ (X16 @ Z0)))) @ X4)) @ X5)|(epred1_0 @ (esk1_0 @ (^[Z0:a]:((epred1_0 @ (X3 @ Z0) @ (X16 @ Z0))))) @ X4)|~((epred1_0 @ (X16 @ (esk3_2 @ (^[Z0:a]:((epred1_0 @ (X3 @ Z0) @ (X16 @ Z0)))) @ X4)) @ X5)))), inference(spm,[status(thm)],[c_0_3, c_0_4])).
24.60/3.60	thf(c_0_6, negated_conjecture, ![X4:a, X5:a]:(((epred1_0 @ (esk2_0 @ X4) @ (esk2_0 @ X5))|~((epred1_0 @ X4 @ X5)))), inference(split_conjunct,[status(thm)],[c_0_2])).
24.60/3.60	thf(c_0_7, negated_conjecture, ![X7:a > $o, X4:a]:(((epred1_0 @ X4 @ (esk1_0 @ X7))|~((X7 @ X4)))), inference(split_conjunct,[status(thm)],[c_0_2])).
24.60/3.60	thf(c_0_8, negated_conjecture, ![X3:a > a, X4:a, X16:a > a, X5:a]:(((epred1_0 @ (X3 @ (esk3_2 @ (^[Z0:a]:((epred1_0 @ (X3 @ Z0) @ (esk2_0 @ (X16 @ Z0))))) @ X4)) @ (esk2_0 @ X5))|(epred1_0 @ (esk1_0 @ (^[Z0:a]:((epred1_0 @ (X3 @ Z0) @ (esk2_0 @ (X16 @ Z0)))))) @ X4)|~((epred1_0 @ (X16 @ (esk3_2 @ (^[Z0:a]:((epred1_0 @ (X3 @ Z0) @ (esk2_0 @ (X16 @ Z0))))) @ X4)) @ X5)))), inference(spm,[status(thm)],[c_0_5, c_0_6])).
24.60/3.60	thf(c_0_9, negated_conjecture, ![X1:a > a > $o, X4:a]:(((epred1_0 @ (esk3_2 @ (^[Z0:a]:((X1 @ Z0 @ Z0))) @ X4) @ (esk1_0 @ (^[Z0:a]:((X1 @ Z0 @ Z0)))))|(epred1_0 @ (esk1_0 @ (^[Z0:a]:((X1 @ Z0 @ Z0)))) @ X4))), inference(spm,[status(thm)],[c_0_7, c_0_4])).
24.60/3.60	thf(c_0_10, negated_conjecture, ![X7:a > $o, X4:a]:(((epred1_0 @ (esk1_0 @ X7) @ X4)|~((epred1_0 @ (esk3_2 @ X7 @ X4) @ X4)))), inference(split_conjunct,[status(thm)],[c_0_2])).
24.60/3.60	thf(c_0_11, negated_conjecture, ![X4:a]:(((epred1_0 @ (esk3_2 @ (^[Z0:a]:((epred1_0 @ Z0 @ (esk2_0 @ Z0)))) @ X4) @ (esk2_0 @ (esk1_0 @ (^[Z0:a]:((epred1_0 @ Z0 @ (esk2_0 @ Z0)))))))|(epred1_0 @ (esk1_0 @ (^[Z0:a]:((epred1_0 @ Z0 @ (esk2_0 @ Z0))))) @ X4))), inference(spm,[status(thm)],[c_0_8, c_0_9])).
24.60/3.60	thf(c_0_12, negated_conjecture, ![X3:a > a, X4:a]:(((epred1_0 @ (esk2_0 @ X4) @ (esk1_0 @ (^[Z0:a]:((epred1_0 @ Z0 @ (esk2_0 @ (X3 @ Z0)))))))|~((epred1_0 @ X4 @ (X3 @ (esk2_0 @ X4)))))), inference(spm,[status(thm)],[c_0_7, c_0_6])).
24.60/3.60	thf(c_0_13, negated_conjecture, (epred1_0 @ (esk1_0 @ (^[Z0:a]:((epred1_0 @ Z0 @ (esk2_0 @ Z0))))) @ (esk2_0 @ (esk1_0 @ (^[Z0:a]:((epred1_0 @ Z0 @ (esk2_0 @ Z0))))))), inference(spm,[status(thm)],[c_0_10, c_0_11])).
24.60/3.60	thf(c_0_14, negated_conjecture, ![X4:a]:((~((epred1_0 @ (esk2_0 @ X4) @ X4))|~((epred1_0 @ X4 @ (esk2_0 @ X4))))), inference(split_conjunct,[status(thm)],[c_0_2])).
24.60/3.60	thf(c_0_15, negated_conjecture, (epred1_0 @ (esk2_0 @ (esk1_0 @ (^[Z0:a]:((epred1_0 @ Z0 @ (esk2_0 @ Z0)))))) @ (esk1_0 @ (^[Z0:a]:((epred1_0 @ Z0 @ (esk2_0 @ Z0)))))), inference(spm,[status(thm)],[c_0_12, c_0_13])).
24.60/3.60	thf(c_0_16, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_14, c_0_15]), c_0_13])]), ['proof']).
24.60/3.60	# SZS output end CNFRefutation
24.60/3.60	# Parsed axioms                        : 2
24.60/3.60	# Removed by relevancy pruning/SinE    : 1
24.60/3.60	# Initial clauses                      : 7
24.60/3.60	# Removed in clause preprocessing      : 0
24.60/3.60	# Initial clauses in saturation        : 7
24.60/3.60	# Processed clauses                    : 949
24.60/3.60	# ...of these trivial                  : 180
24.60/3.60	# ...subsumed                          : 244
24.60/3.60	# ...remaining for further processing  : 525
24.60/3.60	# Other redundant clauses eliminated   : 0
24.60/3.60	# Clauses deleted for lack of memory   : 0
24.60/3.60	# Backward-subsumed                    : 44
24.60/3.60	# Backward-rewritten                   : 60
24.60/3.60	# Generated clauses                    : 55440
24.60/3.60	# ...of the previous two non-redundant : 50341
24.60/3.60	# ...aggressively subsumed             : 0
24.60/3.60	# Contextual simplify-reflections      : 1
24.60/3.60	# Paramodulations                      : 55273
24.60/3.60	# Factorizations                       : 166
24.60/3.60	# NegExts                              : 0
24.60/3.60	# Equation resolutions                 : 1
24.60/3.60	# Propositional unsat checks           : 0
24.60/3.60	#    Propositional check models        : 0
24.60/3.60	#    Propositional check unsatisfiable : 0
24.60/3.60	#    Propositional clauses             : 0
24.60/3.60	#    Propositional clauses after purity: 0
24.60/3.60	#    Propositional unsat core size     : 0
24.60/3.60	#    Propositional preprocessing time  : 0.000
24.60/3.60	#    Propositional encoding time       : 0.000
24.60/3.60	#    Propositional solver time         : 0.000
24.60/3.60	#    Success case prop preproc time    : 0.000
24.60/3.60	#    Success case prop encoding time   : 0.000
24.60/3.60	#    Success case prop solver time     : 0.000
24.60/3.60	# Current number of processed clauses  : 415
24.60/3.60	#    Positive orientable unit clauses  : 78
24.60/3.60	#    Positive unorientable unit clauses: 0
24.60/3.60	#    Negative unit clauses             : 15
24.60/3.60	#    Non-unit-clauses                  : 322
24.60/3.60	# Current number of unprocessed clauses: 48880
24.60/3.60	# ...number of literals in the above   : 153397
24.60/3.60	# Current number of archived formulas  : 0
24.60/3.60	# Current number of archived clauses   : 110
24.60/3.60	# Clause-clause subsumption calls (NU) : 14389
24.60/3.60	# Rec. Clause-clause subsumption calls : 12153
24.60/3.60	# Non-unit clause-clause subsumptions  : 276
24.60/3.60	# Unit Clause-clause subsumption calls : 2025
24.60/3.60	# Rewrite failures with RHS unbound    : 0
24.60/3.60	# BW rewrite match attempts            : 1993
24.60/3.60	# BW rewrite match successes           : 64
24.60/3.60	# Condensation attempts                : 949
24.60/3.60	# Condensation successes               : 4
24.60/3.60	# Termbank termtop insertions          : 12787815
24.60/3.60	
24.60/3.60	# -------------------------------------------------
24.60/3.60	# User time                : 2.951 s
24.60/3.60	# System time              : 0.152 s
24.60/3.60	# Total time               : 3.103 s
24.60/3.60	# Maximum resident set size: 1840 pages
24.60/3.60	
24.60/3.60	# -------------------------------------------------
24.60/3.60	# User time                : 8.949 s
24.60/3.60	# System time              : 0.330 s
24.60/3.60	# Total time               : 9.279 s
24.60/3.60	# Maximum resident set size: 1736 pages
24.60/3.62	EOF
